package newBee.class2;

/**
 * https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/description/
 * 绝对差不超过限制的最长连续子数组
 */
public class Code04_longestSubarray {
    public static void main(String[] args) {
        int[] arr = {8, 2, 4, 7};
        int limit = 4;
        int ans = longestSubarray(arr, limit);

    }

    public static int longestSubarray(int[] arr, int limit) {
//        int h = 0, t = 0, n = arr.length, l = 0, r = 0;
//        int[] deque = new int[n];
//        int[] queue = new int[n];
//        for (int i = 0; i < n; i++) {
//            while (h < t && arr[deque[r - 1]] <= arr[i]) {
//
//            }
//            deque[t++] = i;
//        }
        return 0;
    }
}
